منابع مشابه
Route Finding by Neural Nets
This paper describes a neural implementation of the resistive grid technique for route finding. The resistive grid, or Laplacian planning technique, is not plagued by local minima problems and guaranties and existing route to be found. The neural network comprises 2 layers. In the upper layer, lateral connections between neurons communicate information on the potentials of neighbouring nodes in...
متن کاملAutomated Route Finding on Digital Terrains
Path planning is an important problem in Artificial Intelligence and Robotics. In this paper we examine the problem of finding an optimal path for a road connecting two points in a digital approximation of a real terrain. Additional constraints, such as terrain gradients, will be introduced in order to achieve more realistic roads. A performance comparison will be made between the standard A* a...
متن کاملFinding People and Animals by Guided Assembly
This paper describes a new representation for people and animals, called a body plan. The representation is an organized collection of grouping hints obtained from constraints on color, texture, shape, and geometrical relations. Body plans can be learned from image data, using established statistical learning techniques. Body plans are well adapted to segmentation and recognition in complex env...
متن کاملFinding the Shortest Watchman Route in a Simple Polygon
We present the rst polynomial-time algorithm that nds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is called the shortest watchman route, and we do not assume any restrictions on the route or on the simple polygon. Our algorithm runs in worst case O(n 6) time, but it is adaptive making it run faster on polygons with simple str...
متن کاملRoute Finding in Street Maps by Computers and People
We wrote a computer program which gives driving directions in northern New Jersey. Its data base combines a street map and a telephone book, so requests like “give directions from the Lackawanna Diner to the nearest dry cleaner’* (properly specified) can be answered. This problem involves both human factors and algorithmic problems. From the human factors standpoint, what kind of route is best:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1968
ISSN: 0028-0836,1476-4687
DOI: 10.1038/2181282a0